All k -Bounded Policies Are Equivalent for Self-stabilization
نویسندگان
چکیده
We reduce the problem of proving the convergence of a randomized self-stabilizing algorithm under k-bounded policies to the convergence of the same algorithm under a specific policy. As a consequence, all k-bounded schedules are equivalent : a given algorithm is self-stabilizing under one of them if and only if it is self-stabilizing under any of them.
منابع مشابه
All k - bounded policies are equivalent for self - stabilization Rapport
e redue the prolem of proving the onvergene of rndomized selfEstilizing lgorithm under kEounded poliies to the onvergene of the sme lgorithm under spei poliyF es onsequeneD ll kEounded shedules re equivlent X given lgorithm is selfEstilizing under one of them if nd only if it is selfEstilizing under ny of themF Key words: rndomized lgorithmsD distriute...
متن کاملLocal stabilization for a class of nonlinear impulsive switched system with non-vanishing uncertainties under a norm-bounded control input
Stability and stabilization of impulsive switched system have been considered in recent decades, but there are some issues that are not yet fully addressed such as actuator saturation. This paper deals with expo-nential stabilization for a class of nonlinear impulsive switched systems with different types of non-vanishing uncertainties under the norm-bounded control input. Due to the constraine...
متن کاملFinite time stabilization of time-delay nonlinear systems with uncertainty and time-varying delay
In this paper, the problem of finite-time stability and finite-time stabilization for a specific class of dynamical systems with nonlinear functions in the presence time-varying delay and norm-bounded uncertainty terms is investigated. Nonlinear functions are considered to satisfy the Lipchitz conditions. At first, sufficient conditions to guarantee the finite-time stability for time-delay nonl...
متن کاملSelf-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters
This paper makes contributions in two areas. First, we introduce an extended approach of self-stabilization, called self-stabilization with service guarantee. A self-stabilizing system tolerates transient faults: it automatically recovers to a correct behavior after a stabilization period. However, during stabilization periods, no property on the system behavior is guaranteed. A self-stabilizin...
متن کاملUpper Bounds for Stabilization in Acyclic Preference-Based Systems
Preference-based systems (p.b.s.) describe interactions between nodes of a system that can rank their neighbors. Previous work has shown that p.b.s. converge to a unique locally stable matching if an acyclicity property is verified. In the following we analyze acyclic p.b.s. with respect to the self-stabilization theory. We prove that the round complexity is bounded by n2 for the adversarial da...
متن کامل